Skew-merged Simple Permutations
نویسندگان
چکیده
The simple permutations in two permutation classes — the 321-avoiding permutations and the skew-merged permutations — are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards from the enumeration of the class, but the simple permutations had not been enumerated explicitly. In particular, the enumeration of the simple skew-merged permutations leads to the first truly structural enumeration of this class as a whole. The extension of this method to a wider collection of classes namely grid classes of infinite paths is discussed.
منابع مشابه
Generating and Enumerating 321-Avoiding and Skew-Merged Simple Permutations
The simple permutations in two permutation classes — the 321-avoiding permutations and the skew-merged permutations — are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards from the enumeration of the class, but the simple permutations had not been enumerated explicitly. In particular, the enumeration of the simple skew-merged permut...
متن کاملThe Complexity of Pattern Matching for 321-Avoiding and Skew-Merged Permutations
The PERMUTATION PATTERNMATCHING problem, asking whether a pattern permutation π is contained in a permutation τ, is known to be NPcomplete. In this paper we present two polynomial time algorithms for special cases. The first algorithm is applicable if both π and τ are 321avoiding; the second is applicable if π and τ are skew-merged. Both algorithms have a runtime of Opknq, where k is the length...
متن کاملThe Möbius function of permutations with an indecomposable lower bound
We show that the Möbius function of an interval in a permutation poset where the lower bound is sum (resp. skew) indecomposable depends solely on the sum (resp. skew) indecomposable permutations contained in the upper bound, and that this can simplify the calculation of the Möbius sum. For increasing oscillations, we give a recursion for the Möbius sum which only involves evaluating simple ineq...
متن کاملPattern avoidance and RSK-like algorithms for alternating permutations and Young tableaux
We define a class Ln,k of permutations that generalizes alternating (up-down) permutations. We then give bijective proofs of certain pattern-avoidance results for this class. The bijections employed include are a modified form of the RSK insertion algorithm and a different bijection with RSK-like properties. As a special case of our results, we give two bijections between the set A2n(1234) of a...
متن کاملOn the enumeration of d-minimal permutations
We suggest an approach for the enumeration of minimal permutations having d descents which uses skew Young tableaux. We succeed in finding a general expression for the number of such permutations in terms of (several) sums of determinants. We then generalize the class of skew Young tableaux under consideration; this allows in particular to recover a formula for Eulerian numbers which is a direc...
متن کامل